Towards the animation of proofs – testing proofs by examples
نویسندگان
چکیده
منابع مشابه
Towards Animation of Proofs {testing proofs by examples{
In this paper, we introduce the notion of proof animation. It is a new application of the principle of \Curry-Howard isomorphism" to formal proof developments. Logically, proof animation is merely a contrapositive of \proofs as programs," which is an application of Curry-Howard isomorphism to formal program developments. Nonetheless, the new viewpoint totally changes the scene. The motivation, ...
متن کاملAnimation of Horn Clause Proofs
Janus, a concurrent constraint programming language, provides an efficient and expressive means of constructing distributed and parallel computations [5]. Concurrent logic programming languages [4] are a special case of concurrent constraint programming languages in which the constraint system is confined to the Herbrand domain. Concurrent logic programs are collections of Hom clauses with cont...
متن کاملTowards typed repositories of proofs
Motivations Practical efforts in the formalization of mathematical results have naturally led to the question of how to manage large repositories of proofs, i.e. what is the daily workflow of users of a proof assistant. How does one elaborate a formal proof? What kind of a posteriori modification is he prone to doing? What do these modifications imply on the validity of the whole edifice or, th...
متن کاملTowards Computerized Proofs of Identities
Many of the seemingly trivial facts that we take for granted are really theorems, like the fact that 11 x 12 = 132, or that \ + \ = | . The reason that these are no longer thought of as theorems is that nowadays quite routine algorithms perform these tasks. The same is true, thanks to modern computer algebra programs, for 20 20 the "theorem" that (a + b) —a H , or, thanks to the recent completi...
متن کاملTowards an algebraic natural proofs barrier via polynomial identity testing
We observe that a certain kind of algebraic proof—which covers essentially all known algebraic circuit lower bounds to date—cannot be used to prove lower bounds against VP if and only if what we call succinct hitting sets exist for VP. This is analogous to the Razborov–Rudich natural proofs barrier in Boolean circuit complexity, in that we rule out a large class of lower bound techniques under ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00350-9